#include "../Common/BinaryTree.h"

int main(int argc, char const *argv[])
{
  /* code */
  Node *eleven = new Node(11);
  Node *twelve = new Node(12);
  Node *fourteen = new Node(14);
  Node *fifteen = new Node(15);
  Node *sixteen = new Node(16);
  Node *seventeen = new Node(17);

  eleven->l = twelve;
  eleven->r = fourteen;

  twelve->l = fifteen;
  twelve->r = sixteen;
  fourteen->l = seventeen;

  // ...
  BinaryTree t(eleven);

  // 我们如何能在程序里确认 t 的结构就是我们计划的样子？
  // 有办法过一遍树中所有的节点
  t.preorder();
  return 0;
}
